On the Complexity of #CSP^d

Counting CSP^d is the counting constraint satisfaction problem (#CSP in short) restricted to the instances where every variable occurs a multiple of d times. This paper revisits tractable structures in #CSP and gives a complexity classification theorem for #CSP^d with algebraic complex weights. The result unifies affine functions (stabilizer states in quantum information theory) and related variants such as the local affine functions, the discovery of which leads to all the recent progress on the complexity of Holant problems. The Holant is a framework that generalizes counting CSP. In the literature on Holant problems, weighted constraints are often expressed as tensors (vectors) such that projections and linear transformations help analyze the structure. This paper gives an example showing that different classes of tensors distinguished by these algebraic operations may share the same closure property under tensor product and contraction

[Withdrawn] How Do E-commerce Capabilities Influence Agricultural Firm Performance Gains? Theory and Empirical Evidence

Based on the resource-based view of the firm and from the perspective of organizational agility, thisstudybuilds a model of the factors affecting agricultural firm performance gains in the context of e-commerce and discusses the effects of e-commerce capabilities on firm performance gains. The empirical results show that market capitalizing agility and operational adjustment agility play important mediating roles in conveying positive influences of e-commerce capabilities’ dimensions on financialand non-financial performance gains. Specifically, managerial, analytical, and technical capabilities have different effects on market capitalizing agility and operational adjustment agility, with talent capability performing the most important role. Both market capitalizing agility and operational adjustment agility have positive impacts on financial and non-financial performance gains, respectively

Counting Independent Sets and Colorings on Random Regular Bipartite Graphs

We give a fully polynomial-time approximation scheme (FPTAS) to count the number of independent sets on almost every Delta-regular bipartite graph if Delta >= 53. In the weighted case, for all sufficiently large integers Delta and weight parameters lambda = Omega~ (1/(Delta)), we also obtain an FPTAS on almost every Delta-regular bipartite graph. Our technique is based on the recent work of Jenssen, Keevash and Perkins (SODA, 2019) and we also apply it to confirm an open question raised there: For all q >= 3 and sufficiently large integers Delta=Delta(q), there is an FPTAS to count the number of q-colorings on almost every Delta-regular bipartite graph

The Complexity of Holant Problems over Boolean Domain with Non-Negative Weights

Holant problem is a general framework to study the computational complexity of counting problems. We prove a complexity dichotomy theorem for Holant problems over the Boolean domain with non-negative weights. It is the first complete Holant dichotomy where constraint functions are not necessarily symmetric. Holant problems are indeed read-twice #CSPs. Intuitively, some #CSPs that are #P-hard become tractable when restricted to read-twice instances. To capture them, we introduce the Block-rank-one condition. It turns out that the condition leads to a clear separation. If a function set F satisfies the condition, then F is of affine type or product type. Otherwise (a) Holant(F) is #P-hard; or (b) every function in F is a tensor product of functions of arity at most 2; or (c) F is transformable to a product type by some real orthogonal matrix. Holographic transformations play an important role in both the hardness proof and the characterization of tractability

Efficient Non-Learning Similar Subtrajectory Search

Similar subtrajectory search is a finer-grained operator that can better capture the similarities between one query trajectory and a portion of a data trajectory than the traditional similar trajectory search, which requires the two checked trajectories are similar to each other in whole. Many real applications (e.g., trajectory clustering and trajectory join) utilize similar subtrajectory search as a basic operator. It is considered that the time complexity is O(mn^2) for exact algorithms to solve the similar subtrajectory search problem under most trajectory distance functions in the existing studies, where m is the length of the query trajectory and n is the length of the data trajectory. In this paper, to the best of our knowledge, we are the first to propose an exact algorithm to solve the similar subtrajectory search problem in O(mn) time for most of widely used trajectory distance functions (e.g., WED, DTW, ERP, EDR and Frechet distance). Through extensive experiments on three real datasets, we demonstrate the efficiency and effectiveness of our proposed algorithms.Comment: VLDB 202

Mass Loss and Chemical Structures of Wheat and Maize Straws in Response to Ultravoilet-B Radiation and Soil Contact

The role of photodegradation, an abiotic process, has been largely overlooked during straw decomposition in mesic ecosystems. We investigated the mass loss and chemical structures of straw decomposition in response to elevated UV-B radiation with or without soil contact over a 12-month litterbag experiment. Wheat and maize straw samples with and without soil contact were exposed to three radiation levels: a no-sunlight control, ambient solar UV-B, and artificially elevated UV-B radiation. A block control with soil contact was not included. Compared with the no-sunlight control, UV-B radiation increased the mass loss by 14-19% and the ambient radiation by 9-16% for wheat and maize straws without soil contact after 12 months. Elevated UV-B exposure decreased the decomposition rates of both wheat and maize straws when in contact with soil. Light exposure resulted in decreased O-alkyl carbons and increased alkyl carbons for both the wheat and maize straws compared with no-sunlight control. The difference in soil contact may influence the contribution of photodegradation to the overall straw decomposition process. These results indicate that we must take into account the effects of photodegradation when explaining the mechanisms of straw decomposition in mesic ecosystems

Microorganism-regulated mechanisms of temperature effects on the performance of anaerobic digestion

Additional file 2. Additional tables

Organic amendments with high proportion of heterocyclic compounds promote soil microbiome shift and microbial use efficiency of straw-C

Soil microbial use efficiency of straw carbon (C), which is the proportion of straw-C microbes assimilate into new biosynthetic material relative to C lost out of the system as CO2, is critical in increasing soil organic C (SOC) content, and hence maintaining soil fertility and productivity. However, the effect of chemical structures of the organic amendments (OAs) on the microbial use efficiency of straw-C remains unclear. The effect of the chemical structure of the OAs on microbial use efficiency of straw-C was elucidated by a combination of 13C-straw labeling with high-throughput sequencing and pyrolysis-GC/MS. We found a strong positive correlation between the microbial use efficiency of straw-C and the proportion of heterocyclic compounds (Hete_C). The microbial use efficiency of straw-C was highest in soil supplemented with Hete_C-dominant OAs, which significantly shifted microbial community structure toward fungal dominance. Specifically, fungal-to-bacterial ratio, fungal richness, and the relative abundance of Ascomycota were higher in soil with a higher proportion of Hete_C-dominant OAs. Together, our study suggests that OAs with high proportion of Hete_C promote the microbial use efficiency of straw-C by increasing the dominance of fungi in the soil microbial community in agroecosystems